Successful Manipulation in Stable Marriage Model with Complete Preference Lists
نویسندگان
چکیده
منابع مشابه
Successful Manipulation in Stable Marriage Model with Complete Preference Lists
This paper deals with a strategic issue in the stable marriage model with complete preference lists (i.e., a preference list of an agent is a permutation of all the members of the opposite sex). Given complete preference lists of nmen over n women, and a marriage μ, we consider the problem for finding preference lists of n women over n men such that the men-proposing deferred acceptance algorit...
متن کاملThe stable marriage problem with master preference lists
We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a master preference list. This models real-world matching problems in which participants may be ranked according to some objective criteria. The master list(s) may be strictly ordered, or may include ties, and the lists of individuals may involve ties and may in...
متن کاملStable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that ...
متن کاملStable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ones: one is to allow an incomplete list, i.e., a man is permitted to accept only a subset of the women and vice versa. The other is to allow a pr...
متن کاملDistributed Stable Matching with Similar Preference Lists
Consider a complete bipartite graph of 2n nodes with n nodes on each side. In a round, each node can either send at most one message to a neighbor or receive at most one message from a neighbor. Each node has a preference list that ranks all its neighbors in a strict order from 1 to n. We introduce a non-negative similarity parameter ∆ < n for the preference lists of nodes on one side only. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.116